全文获取类型
收费全文 | 6877篇 |
免费 | 1195篇 |
国内免费 | 1028篇 |
专业分类
电工技术 | 198篇 |
综合类 | 703篇 |
化学工业 | 36篇 |
金属工艺 | 3篇 |
机械仪表 | 152篇 |
建筑科学 | 24篇 |
矿业工程 | 32篇 |
能源动力 | 41篇 |
轻工业 | 11篇 |
水利工程 | 156篇 |
石油天然气 | 10篇 |
武器工业 | 27篇 |
无线电 | 2389篇 |
一般工业技术 | 249篇 |
冶金工业 | 25篇 |
原子能技术 | 2篇 |
自动化技术 | 5042篇 |
出版年
2024年 | 6篇 |
2023年 | 94篇 |
2022年 | 113篇 |
2021年 | 131篇 |
2020年 | 204篇 |
2019年 | 134篇 |
2018年 | 162篇 |
2017年 | 236篇 |
2016年 | 280篇 |
2015年 | 399篇 |
2014年 | 490篇 |
2013年 | 560篇 |
2012年 | 636篇 |
2011年 | 677篇 |
2010年 | 589篇 |
2009年 | 639篇 |
2008年 | 651篇 |
2007年 | 662篇 |
2006年 | 509篇 |
2005年 | 444篇 |
2004年 | 367篇 |
2003年 | 282篇 |
2002年 | 207篇 |
2001年 | 192篇 |
2000年 | 113篇 |
1999年 | 67篇 |
1998年 | 57篇 |
1997年 | 37篇 |
1996年 | 30篇 |
1995年 | 26篇 |
1994年 | 23篇 |
1993年 | 20篇 |
1992年 | 16篇 |
1991年 | 13篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1980年 | 3篇 |
排序方式: 共有9100条查询结果,搜索用时 15 毫秒
11.
为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本. 相似文献
12.
互联网流量的爆发式增长,叠加互联网流量固有的突发性特点,使得网络流量不均衡现象日益加剧。传统BGP协议由于缺乏全网拓扑和全局流量观,只能遵循标准BGP选路原则,在解决流量调度和负载均衡方面存在不足。针对BGP协议存在的局限性,研发了基于RR+的互联网骨干网流量调度系统,并应用于ChinaNet骨干网的网内中继、网间互联出口、IDC出口等多个流量优化场景。更进一步地,提出了一种基于SDN的互联网域间路由架构,通过在域间控制器之间交换BGP路由,无需在域内和域间运行BGP协议,极大地简化了网络协议,并能够实现灵活的流量调度和负载均衡。 相似文献
13.
Jonatas B. C. Chagas Ulisses E. F. Silveira Andr G. Santos Marcone J. F. Souza 《International Transactions in Operational Research》2020,27(1):112-137
This paper addresses the double vehicle routing problem with multiple stacks (DVRPMS) in which a fleet of vehicles must collect items in a pickup region and then travel to a delivery region where all items are delivered. The load compartment of all vehicles is divided into rows (horizontal stacks) of fixed profundity (horizontal heights), and on each row, the unloading process must respect the last‐in‐first‐out policy. The objective of the DVRPMS is to find optimal routes visiting all pickup and delivery points while ensuring the feasibility of the vehicle loading plans. We propose a new integer linear programming formulation, which was useful to find inconsistencies in the results of exact algorithms proposed in the literature, and a variable neighborhood search based algorithm that was able to find solutions with same or higher quality in shorter computational time for most instances when compared to the methods already present in the literature. 相似文献
14.
拟通过单向时延的历史记录对其未来趋势进行预测。首先,通过粗粒度和细粒度两种方式采集世界各地若干目标节点的单向时延作为原始数据;然后,结合多种预测模型的特点和原始数据的内在属性,提出一种基于ARMA模型的双路径差异性分析方法;最后选取合理的预测窗口对方法的准确性进行验证。结果表明,该预测方法是正确、合理的,与灰色预测模型相比能更有效地预测单项时延差序列。 相似文献
15.
In this paper, we conduct a comprehensive performance study of distributed and dynamic mobility management (DDMM). DDMM presents a new architectural paradigm for a sustainable mobile networking against an ever-increasing amount of Internet data traffic, providing IP mobility management with distributed deployment of mobility anchors and dynamic activation when mobility is needed. Such a distributed mobility management concept is generally and intuitively accepted in terms of effective distribution of mobile traffic when compared with centralized mobility management (CMM) approaches. Nevertheless, the routing strategy of DDMM has not yet been properly examined through performance studies, and especially the impact of potential mobility routing strategies on the user plane is an open question. We perform a mathematical analysis of DDMM and present numerical results aiming to identify in which conditions, by which factors, and how much, DDMM improves mobility performance. For comparison, Mobile IPv6, Proxy Mobile IPv6 (PMIPv6), and PMIPv6 localized routing (PMIPv6-LR) were considered as representative IP mobility protocols following CMM approaches. Analytical results demonstrate that DDMM generally achieves higher performance when compared with CMM-based protocols in terms of packet delivery cost, tunneling overhead, and throughput, but specific performance varies in function of multiple input parameters. 相似文献
16.
17.
The vehicle routing problem (VRP) is an important transportation problem. The literature addresses several extensions of this problem, including variants having delivery time windows associated with customers and variants allowing split deliveries to customers. The problem extension including both of these variations has received less attention in the literature. This research effort sheds further light on this problem. Specifically, this paper analyzes the effects of combinations of local search (LS) move operators commonly used on the VRP and its variants. We find when paired with a MAX-MIN Ant System constructive heuristic, Or-opt or 2-opt⁎ appear to be the ideal LS operators to employ on the VRP with split deliveries and time windows with Or-opt finding higher quality solutions and 2-opt⁎ requiring less run time. 相似文献
18.
The dynamic vehicle routing and scheduling problem is a well-known complex combinatorial optimization problem that drew significant attention over the past few years. This paper presents a novel algorithm introducing a new strategy to integrate anticipated future visit requests during plan generation, aimed at explicitly improving customer satisfaction. An evaluation of the proposed strategy is performed using a hybrid genetic algorithm previously designed for the dynamic vehicle problem with time windows that we modified to capture customer satisfaction over multiple visits. Simulations compare the value of the revisited algorithm exploiting the new strategy, clearly demonstrating its impact on customer satisfaction level. 相似文献
19.
In this paper, we present heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem arising in a real-world situation. In this problem, customers make requests of goods, which are packed in a sortment of boxes. The objective is to find minimum cost delivery routes for a set of identical vehicles that, departing from a depot, visit all customers only once and return to the depot. Apart of the usual 3D container loading constraints which ensure that the boxes are packed completely inside the vehicles and that the boxes do not overlap each other in each vehicle, the problem also takes into account constraints related to the vertical stability of the cargo and multi-drop situations. The algorithms are based on the combination of classical heuristics from both vehicle routing and container loading literatures, as well as two metaheuristic strategies, and their use in more elaborate procedures. Although these approaches cannot assure optimal solutions for the respective problems, they are relatively simple, fast enough to solve real instances, flexible enough to include other practical considerations, and normally assure relatively good solutions in acceptable computational times in practice. The approaches are also sufficiently generic to be embedded with algorithms other than those considered in this study, as well as they can be easily adapted to consider other practical constraints, such as the load bearing strength of the boxes, time windows and pickups and deliveries. Computational tests were performed with these methods considering instances based on the vehicle routing literature and actual customers’ orders, as well as instances based on a real-world situation of a Brazilian carrier. The results show that the heuristics are able to produce relatively good solutions for real instances with hundreds of customers and thousands of boxes. 相似文献
20.
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time. 相似文献